Improved quantum backtracking algorithms using effective resistance estimates
نویسندگان
چکیده
منابع مشابه
Improved quantum backtracking algorithms through effective resistance estimates
We investigate quantum backtracking algorithms of a type previously introduced by Montanaro (arXiv:1509.02374). These algorithms explore trees of unknown structure, and in certain cases exponentially outperform classical procedures (such as DPLL). Some of the previous work focused on obtaining a quantum advantage for trees in which a unique marked vertex is promised to exist. We remove this res...
متن کاملRelevant Backtracking: Improved Intelligent Backtracking Using Relevance
This work investigates and develops a backtracking algorithm with a novel approach to enumerating and traversing search space. A basic logical framework inspired by relevant logics is presented, highlighting relationships between search and refutation proof construction. Mechanisation of a relevance aware Davis Putnam Logemann Loveland procedure is investigated, and this yields an intelligent b...
متن کاملQuantum walk speedup of backtracking algorithms
We describe a general method to obtain quantum speedups of classical algorithms which are based on the technique of backtracking, a standard approach for solving constraint satisfaction problems (CSPs). Backtracking algorithms explore a tree whose vertices are partial solutions to a CSP in an attempt to find a complete solution. Assume there is a classical backtracking algorithm which finds a s...
متن کاملBacktracking Search Algorithms
There are three main algorithmic techniques for solving constraint satisfaction problems: backtracking search, local search, and dynamic programming. In this chapter, I survey backtracking search algorithms. Algorithms based on dynamic programming [15]— sometimes referred to in the literature as variable elimination, synthesis, or inference algorithms—are the topic of Chapter 7. Local or stocha...
متن کاملBetter Algorithms for Parallel Backtracking
Many algorithms in operations research and artiicial intelligence are based on the backtracking principle, i.e., depth rst search in implicitly deened trees. For parallelizing these algorithms, a load balancing scheme is needed which is able to evenly distribute the parts of an irregularly shaped tree over the processors. It should work with minimal interprocessor communication and without prio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2018
ISSN: 2469-9926,2469-9934
DOI: 10.1103/physreva.97.022337